A From LTL to Deterministic Automata–A Safraless Compositional Approach
نویسندگان
چکیده
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a co-Büchi automaton for φ and an array of Rabin automata, one for each G-subformula of φ. The Rabin automaton for Gψ is in charge of recognizing whether FGψ holds. This information is passed to the co-Büchi automaton that decides on acceptance. As opposed to standard procedures based on Safra’s determinization, the states of all our automata have a clear logical structure, which allows for various optimizations. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.
منابع مشابه
From LTL to Deterministic Automata: A Safraless Compositional Approach
We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each Gsubformula of φ. The slave automaton for Gψ is in charge of recognizing whether FGψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, w...
متن کاملAutomata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12,GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generaliz...
متن کاملFrom LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL fo...
متن کاملSafraless Compositional Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, little of this theory has been reduced to practice. This is in contrast with model-checking theory, which has led to industrial development and use of formal verification tools. We see two main reasons for the lack of pra...
متن کاملComparison of LTL to Deterministic Rabin Automata Translators
Increasing interest in control synthesis and probabilistic model checking caused recent development of LTL to deterministic ω-automata translation. The standard approach represented by ltl2dstar tool employs Safra’s construction to determinize a Büchi automaton produced by some LTL to Büchi automata translator. Since 2012, three new LTL to deterministic Rabin automata translators appeared, name...
متن کامل